Dynamic load balancing and efficient load estimators for asynchronous iterative algorithms
نویسندگان
چکیده
منابع مشابه
Iterative algorithms for distributed load balancing
We consider the load balancing problem for a synchronous distributed processor network. The processor network is modeled by an undirected, connected graph G = (V;E) in which node vi 2 V possesses a computational load ui. We want to determine a schedule in order to move load across edges so that the weight on each node is approximately equal. This problem models load balancing when we associate ...
متن کاملAsynchronous Dynamic Load Balancing of Tiles
Many scienti c computations have work-intensive kernels consisting of nested loops with a regular stencil of data dependences. For such loop nests, tiling [3] is a well-known compiler optimization that can help achieve e cient parallelism. For a loop nest of depth K, tiling partitions the K-dimensional space of iterations into regular size and shape chunks of work. These tiles are allocated to ...
متن کاملAsynchronous Random Polling Dynamic Load Balancing
Many applications in parallel processing have to traverse large, implicitly deened trees with irregular shape. The receiver initiated load balancing algorithm random polling has long been known to be very eecient for these problems in practice. For any > 0, we prove that its parallel execution time is at most (1 +)Tseq=P + O(Tatomic + h(1 +Trout +T split)) with high probability, where Trout, T ...
متن کاملOn Simple Algorithms for Dynamic Load Balancing
This paper focuses on the dynamic resource allocation problem. In communication networks such as wireless or circuit switching networks, resources correspond to base stations or links, and the load corresponds to the calls in the network. The principle of load balancing is examined for dynamic resource allocation. The question of interest is the performance of simple allocation strategies which...
متن کاملAccelerated diffusion algorithms for dynamic load balancing
We consider the load balancing problem for a synchronous distributed processor network. The processor network is modeled by an undirected, connected graph G = (V,E) in which node vi ∈ V possesses a computational load wi. We want to determine a schedule in order to move load across edges so that the weight on each node is approximately equal. This problem models load balancing when we associate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2005
ISSN: 1045-9219
DOI: 10.1109/tpds.2005.45